Memory efficient modeling of polyphone context with weighted finite-state transducers

نویسندگان

  • Emilian Stoimenov
  • John W. McDonough
چکیده

In earlier work, we derived a transducer HC that translates from sequences of Gaussian mixture models directly to phone sequences. The HC transducer was statically expanded then determinized and minimized. In this work, we present a refinement of the correct algorithm whereby the initial HC transducer is incrementally expanded and immediately determinized. This technique avoids the need for a full expansion of the initial HC, and thereby reduces the random access memory required to produce the determinized HC by a factor of more than five. With the incremental algorithm, we were able to construct HC for a semi-continuous acoustic model with 16,000 distributions which reduced the word error rate from 34.1% to 32.9% with respect to a fully-continuous system with 4,000 distributions on the lecture meeting portion of the NIST RT05 data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using context-free grammars for embedded speech recognition with Weighted Finite-State Transducers

In this paper we propose an extension to weighted finite-state transducers in order to enable them to model context-free grammars. Classical finite-state transducers are restricted to modeling regular grammars. However, for some tasks it is necessary to use more general context-free grammars. Even some regular grammar models can be scaled down using context-free rules. The paper extents the tra...

متن کامل

Using Dynamic Wfst Composition for R

Our first application of weighted finite state transducers to the recognition of broadcast news provided us with an interesting framework to study several problems related to the optimization of the search space. The paper starts by describing how the use of our lexicon and language model “on-the-fly” composition algorithm is crucial in extending the transducer approach to large systems. We pre...

متن کامل

Investigations on search methods for speech recognition using weighted finite-state transducers

The search problem in the statistical approach to speech recognition is to find the most likely word sequence for an observed speech signal using a combination of knowledge sources, i.e. the language model, the pronunciation model, and the acoustic models of phones. The resulting search space is enormous. Therefore, an efficient search strategy is required to compute the result with a feasible ...

متن کامل

An Efficient Compiler for Weighted Rewrite Rules

Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorith...

متن کامل

Explicit Modeling of Phonological Changes in Finite-state Transducer Based Hungarian Lvcsr

This article describes the operation and the experimental evaluation of the pronunciation modeling component of the first Hungarian large vocabulary continuous speech recognition system. The proposed method is based on the implementation of context dependent rewrite rules by weighted finite state transducers (WFSTs). The proposed phonological model decreases the error rate by 8.32% relatively c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007